Incremental recomputation in local languages
نویسندگان
چکیده
منابع مشابه
Incremental recomputation in local languages
We study the problem of maintaining recursively defined views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanisms. The main results of this paper are negative ones: we show that a certain property of query languages implies impossibility of such incremental maintenance. The property we use is locality of queries, which is know...
متن کاملTowards Practical Incremental Recomputation for Scientists: An Implementation for the Python Language
Computational scientists often prototype data analysis scripts using high-level languages like Python. To speed up execution times, they manually refactor their scripts into stages (separate functions) and write extra code to save intermediate results to disk in order to avoid recomputing them in subsequent runs. To eliminate this burden, we enhanced the Python interpreter to automatically memo...
متن کاملAn Improved Algorithm for the Incremental Recomputation of Active Relational Expressions
| In 1] Qian and Wiederhold presented an algorithm for the incremental recomputation of relational algebra expressions that was claimed to preserve a certain minimality condition. This condition guarantees that the in-cremental change sets do not contain any unnecessary tu-ples and so redundant computations are not performed. We show that in fact their algorithm violates this condition. We pres...
متن کاملIncremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
We examine the power of incremental evaluation systems that use an SQL-like language formaintaining recursively-de ned views. We show that recursive queries such as transitive closure,and \alternating paths" can be incrementally maintained in a nested relational language, whensome auxiliary relations are allowed. In the presence of aggregate functions, even more queries canbe ma...
متن کاملAll that Incremental is not Efficient: Towards Recomputation Based Complex Event Processing for Expensive Queries
Complex Event Processing (CEP) deals with matching a stream of events with the query patterns to extract complex matches. These matches incrementally emerge over time while the partial matches accumulate in the memory. The number of partial matches for expressive CEP queries can be polynomial or exponential to the number of events within a time window. Hence, traditional strategies result in an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00017-8